An O (log k )-Competitive Algorithm for Generalized Caching
نویسندگان
چکیده
منابع مشابه
An O(log k)-competitive algorithm for generalized caching
In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp ≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loa...
متن کاملAn O(log k)-competitive Algorithm for Metric Bipartite Matching
We consider the online metric matching problem. In this problem, we are given a graph with edge weights satisfying the triangle inequality, and k vertices that are designated as the right side of the matching. Over time up to k requests arrive at an arbitrary subset of vertices in the graph and each vertex must be matched to a right side vertex immediately upon arrival. A vertex cannot be remat...
متن کاملAn O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
In this paper, we show that there is an O(log k log n)-competitive randomized algorithm for the k-sever problem on any metric space with n points, which improved the previous best competitive ratio O(log k log n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267276).
متن کاملAn O(log m)-Competitive Algorithm for Online Machine Minimization
We consider the online machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. Our main result is a general O(m logm)-competitive algorithm for the preemptive online problem, where m is the optimal number of machines used in an offline solution. This is the first ...
متن کاملAn O (log2 k )-Competitive Algorithm for Metric Bipartite Matching
We consider the online metric matching problem. In this problem, we are given a graph with edge weights satisfying the triangle inequality, and k vertices that are designated as the right side of the matching. Over time up to k requests arrive at an arbitrary subset of vertices in the graph and each vertex must be matched to a right side vertex immediately upon arrival. A vertex cannot be remat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2019
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3280826